WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(8)
  "0" :: [] -(0)-> "A"(0)
  "Cons" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(14)
  "S" :: ["A"(8)] -(8)-> "A"(8)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "fold#3" :: ["A"(14)] -(1)-> "A"(0)
  "main" :: ["A"(14)] -(16)-> "A"(0)
  "plus#2" :: ["A"(8) x "A"(0)] -(8)-> "A"(0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0)
  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "fold#3" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "plus#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"Cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)